Quantum Algorithms for a Set of Group Theoretic Problems

We study two group theoretic problems, Group Intersection and Double Coset Membership, in the setting of black-box groups, where Double Coset Membership generalizes a set of problems, including Group Membership, Group Factorization, and Coset Intersection. No polynomial-time classical algorithms are known for these problems. We show that for solvable groups, there exist efficient quantum algorithms for Group Intersection if one of the underlying solvable groups has a smoothly solvable commutator subgroup, and for Double Coset Membership if one of the underlying solvable groups is smoothly solvable. We also study the decision versions of Stabilizer and Orbit Coset, which generalizes Group Intersection and Double Coset Membership, respectively. We show that they reduce to Orbit Superposition under certain conditions. Finally, we show that Double Coset Membership and Double Coset Nonmembership have zero knowledge proof systems.